#pragma GCC optimize(2)
#include <iostream>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <unordered_set>
#include <stack>
#include <bitset>
#define F first
#define S second
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

void solve()
{
	int n,x,y;
	cin>>x>>y>>n;
	vector<int> b(n+5);
	vector<int> a(n+5);
	a[1]=x;
	a[n]=y;
	int num=x;
	int d=n-1;
	int f=1;
	for(int i=2;i<=n;i++)
	{
		num+=d;
		b[i]=d;
		d--;
		if(num>y)
		{
			f=0;
			break;
		}
	}
	b[2]+=(y-num);
	if(f)
	{
		for(int i=2;i<=n;i++)
		{
			a[i]=a[i-1]+b[i];
		}
		for(int i=1;i<=n;i++) cout<<a[i]<<' '; 
		cout<<endl;
	}
	else cout<<-1<<endl;
}
int main()
{
	IOS;
	int T=1;
	cin>>T;

	while(T--)
	{
		solve();
	}

	return 0;
}

